On Small Accepting Networks of Evolutionary Processors with Regular Filters

We show that every context-sensitive language can be accepted by an accepting network of non-increasing evolutionary processors with one substitution processor and one output node whose communication is controlled by regular languages. Every recursively enumerable language can be accepted by a network with three evolutionary processors: one substitution processor, one insertion processor and one output node. Also with insertion and deletion processors only (without substitution nodes), all recursively enumerable languages can be accepted. Then one insertion node, one deletion node and one output node are sufficient.